t = int(input())
for _ in range(0,t):
n = int(input())
elens=0
olens=0
zeros=0
ones=0
for i in range(0,n):
num1 = input()
if(len(num1)%2==0):
elens+=1
else:
olens+=1
for j in range(0,len(num1)):
if(num1[j]=="0"):
zeros+=1
else:
ones+=1
if(olens>0):
print(n)
else:
if(zeros%2==1 and ones%2==1):
print(n-1)
else:
print(n)
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin>>t;
while(t--)
{
long long n;
cin>>n;
vector<string>v(n);
for(long long i=0;i<n;i++)
{
cin>>v[i];
}
long long z=0,o=0,len=0;
for(long long i=0;i<n;i++)
{
for(long long j=0;j<v[i].size();j++)
{
if(v[i][j]=='0')
z++;
else
o++;
}
len+=(v[i].size()/2);
}
if((z/2)+(o/2)>=len)
{
cout<<n<<endl;
}
else
cout<<n-1<<endl;
}
}
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |